Layered and object-based game semantics

نویسندگان

چکیده

Large-scale software verification relies critically on the use of compositional languages, semantic models, specifications, and techniques. Recent work certified abstraction layers synthesizes game semantics, refinement calculus, algebraic effects to enable composition heterogeneous components into larger systems. However, in existing models layers, compositionality is restricted by lack encapsulation state. In this paper, we present a novel model for where semantics layer interfaces implementations are defined solely based their observable behaviors. Our key idea leverage Reddy's pioneer modeling imperative languages not as functions global states but objects with We show that interface can be modeled an object type (i.e., signature) plus strategy. A implementation then essentially regular map, sense Reddy, from underlay signature overlay signature. when its strategy implements also describe extension allows non-determinism interfaces. After formulating maps between spaces, move concurrency design notion concurrent space, sequential traces may identified modulo permutation independent operations. how express protected shared concurrency, ticket lock implementation, simple spaces.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Game semantics for an object-oriented language

This thesis investigates the relationship between object-oriented programming languages and game models of computation. These are intuitively well matched: an object encapsulates some internal state and presents some behaviour to the world via its publicly visible methods, while a strategy for some game represents the possible interactions of a program with its environment. We work with a simpl...

متن کامل

Algorithmic Game Semantics and Component-Based Verification

We present a research programme dedicated to the application of Game Semantics to program analysis and verification. We highlight several recent theoretical results and describe a prototypical software modeling and verification tool. The distinctive novel features of the tool are its ability to handle open programs and the fact that the models it produces are observationally fully abstract. The...

متن کامل

Game Semantics

ion is modelled by currying: [[ ` x : A:M : A! B]] = ([[ ; x : A `M : B]]) : [[ ]]! [[A]]) [[B]]: The interpretation of application makes use of the evaluation map ev : (A) B) A ! B obtained by uncurrying the identity on A ) B. If ` M : A ! B and ` N : A then [[ `MN ]] = h[[ `M ]]; [[ ` N ]]i # ev: We shall now show how PCF can be interpreted in any of the cartesian closed categories C, Ci, Cb ...

متن کامل

Game semantics and subtyping

Game Semantics is a relatively new framework for the description of the semantics of programming languages. By combining the mathematical elegance of Denotational Semantics with explicitly operational concepts, Game Semantics has made possible the direct and intuitive modelling of a large range of programming constructs. In this thesis, we show how Game Semantics is able to model subtyping. We ...

متن کامل

Declarative Semantics in Object-Oriented Software Development - A Taxonomy and Survey

One of the modern paradigms to develop an application is object oriented analysis and design. In this paradigm, there are several objects and each object plays some specific roles in applications. In an application, we must distinguish between procedural semantics and declarative semantics for their implementation in a specific programming language. For the procedural semantics, we can write a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ACM on programming languages

سال: 2022

ISSN: ['2475-1421']

DOI: https://doi.org/10.1145/3498703